0.09/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.09/0.13 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.11/0.34 % Computer : n018.cluster.edu 0.11/0.34 % Model : x86_64 x86_64 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.34 % Memory : 8042.1875MB 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.34 % CPULimit : 1200 0.11/0.34 % WCLimit : 120 0.11/0.34 % DateTime : Tue Jul 13 11:29:08 EDT 2021 0.11/0.34 % CPUTime : 0.11/0.34 % Number of cores: 8 0.11/0.34 % Python version: Python 3.6.8 0.11/0.34 # Version: 2.6rc1-ho 0.11/0.34 # No SInE strategy applied 0.11/0.34 # Trying AutoSched0 for 59 seconds 0.11/0.38 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S00A 0.11/0.38 # and selection function NoSelection. 0.11/0.38 # 0.11/0.38 # Preprocessing time : 0.028 s 0.11/0.38 # Presaturation interreduction done 0.11/0.38 0.11/0.38 # Proof found! 0.11/0.38 # SZS status Theorem 0.11/0.38 # SZS output start CNFRefutation 0.11/0.38 thf(cCADE13_pme, conjecture, ((![X1:$i, X2:$i]:cP @ X1 @ X2|![X1:$i, X2:$i]:cQ @ X1 @ X2)<=(((![X1:$i, X2:$i]:(cP @ X1 @ X2|cQ @ X1 @ X2)&![X1:$i, X2:$i]:(cQ @ X1 @ X2=>cQ @ X2 @ X1))&![X1:$i, X2:$i, X3:$i]:(cQ @ X1 @ X3<=(cQ @ X1 @ X2&cQ @ X2 @ X3)))&![X1:$i, X2:$i, X3:$i]:(cP @ X1 @ X3<=(cP @ X2 @ X3&cP @ X1 @ X2)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cCADE13_pme)). 0.11/0.38 thf(c_0_1, plain, (epred1_0<=>(((![X1:$i, X2:$i]:(cP @ X1 @ X2|cQ @ X1 @ X2)&![X1:$i, X2:$i]:(cQ @ X1 @ X2=>cQ @ X2 @ X1))&![X1:$i, X2:$i, X3:$i]:((cQ @ X1 @ X2&cQ @ X2 @ X3)=>cQ @ X1 @ X3))&![X1:$i, X2:$i, X3:$i]:((cP @ X2 @ X3&cP @ X1 @ X2)=>cP @ X1 @ X3))), introduced(definition)). 0.11/0.38 thf(c_0_2, plain, (epred1_0=>(((![X1:$i, X2:$i]:(cP @ X1 @ X2|cQ @ X1 @ X2)&![X1:$i, X2:$i]:(cQ @ X1 @ X2=>cQ @ X2 @ X1))&![X1:$i, X2:$i, X3:$i]:((cQ @ X1 @ X2&cQ @ X2 @ X3)=>cQ @ X1 @ X3))&![X1:$i, X2:$i, X3:$i]:((cP @ X2 @ X3&cP @ X1 @ X2)=>cP @ X1 @ X3))), inference(split_equiv,[status(thm)],[c_0_1])). 0.11/0.38 thf(c_0_3, negated_conjecture, ~((epred1_0=>(![X1:$i, X2:$i]:cP @ X1 @ X2|![X1:$i, X2:$i]:cQ @ X1 @ X2))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cCADE13_pme])]), c_0_1])). 0.11/0.38 thf(c_0_4, plain, ![X22:$i, X23:$i, X24:$i, X25:$i, X26:$i, X27:$i, X28:$i, X29:$i, X30:$i, X31:$i]:((((cP @ X22 @ X23|cQ @ X22 @ X23|~epred1_0)&(~cQ @ X24 @ X25|cQ @ X25 @ X24|~epred1_0))&(~cQ @ X26 @ X27|~cQ @ X27 @ X28|cQ @ X26 @ X28|~epred1_0))&(~cP @ X30 @ X31|~cP @ X29 @ X30|cP @ X29 @ X31|~epred1_0)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])). 0.11/0.38 thf(c_0_5, negated_conjecture, (epred1_0&(~cP @ esk1_0 @ esk2_0&~cQ @ esk3_0 @ esk4_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])). 0.11/0.38 thf(c_0_6, plain, ![X1:$i, X2:$i]:(cP @ X1 @ X2|cQ @ X1 @ X2|~epred1_0), inference(split_conjunct,[status(thm)],[c_0_4])). 0.11/0.38 thf(c_0_7, negated_conjecture, epred1_0, inference(split_conjunct,[status(thm)],[c_0_5])). 0.11/0.38 thf(c_0_8, plain, ![X1:$i, X2:$i, X3:$i]:(cQ @ X1 @ X3|~cQ @ X1 @ X2|~cQ @ X2 @ X3|~epred1_0), inference(split_conjunct,[status(thm)],[c_0_4])). 0.11/0.38 thf(c_0_9, negated_conjecture, ~cP @ esk1_0 @ esk2_0, inference(split_conjunct,[status(thm)],[c_0_5])). 0.11/0.38 thf(c_0_10, plain, ![X1:$i, X2:$i]:(cP @ X1 @ X2|cQ @ X1 @ X2), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6, c_0_7])])). 0.11/0.38 thf(c_0_11, plain, ![X3:$i, X2:$i, X1:$i]:(cP @ X3 @ X2|~cP @ X1 @ X2|~cP @ X3 @ X1|~epred1_0), inference(split_conjunct,[status(thm)],[c_0_4])). 0.11/0.38 thf(c_0_12, negated_conjecture, ~cQ @ esk3_0 @ esk4_0, inference(split_conjunct,[status(thm)],[c_0_5])). 0.11/0.38 thf(c_0_13, plain, ![X1:$i, X2:$i, X3:$i]:(cQ @ X1 @ X2|~cQ @ X3 @ X2|~cQ @ X1 @ X3), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8, c_0_7])])). 0.11/0.38 thf(c_0_14, plain, ![X1:$i, X2:$i]:(cQ @ X2 @ X1|~cQ @ X1 @ X2|~epred1_0), inference(split_conjunct,[status(thm)],[c_0_4])). 0.11/0.38 thf(c_0_15, negated_conjecture, cQ @ esk1_0 @ esk2_0, inference(spm,[status(thm)],[c_0_9, c_0_10])). 0.11/0.38 thf(c_0_16, plain, ![X1:$i, X3:$i, X2:$i]:(cP @ X1 @ X2|~cP @ X1 @ X3|~cP @ X3 @ X2), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_7])])). 0.11/0.38 thf(c_0_17, negated_conjecture, ![X1:$i]:(~cQ @ X1 @ esk4_0|~cQ @ esk3_0 @ X1), inference(spm,[status(thm)],[c_0_12, c_0_13])). 0.11/0.38 thf(c_0_18, plain, ![X2:$i, X1:$i]:(cQ @ X1 @ X2|~cQ @ X2 @ X1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_7])])). 0.11/0.38 thf(c_0_19, plain, ![X1:$i]:(cQ @ X1 @ esk2_0|~cQ @ X1 @ esk1_0), inference(spm,[status(thm)],[c_0_13, c_0_15])). 0.11/0.38 thf(c_0_20, negated_conjecture, ![X1:$i]:(~cP @ esk1_0 @ X1|~cP @ X1 @ esk2_0), inference(spm,[status(thm)],[c_0_9, c_0_16])). 0.11/0.38 thf(c_0_21, plain, ![X1:$i]:(~cQ @ X1 @ esk4_0|~cQ @ X1 @ esk3_0), inference(spm,[status(thm)],[c_0_17, c_0_18])). 0.11/0.38 thf(c_0_22, plain, ![X1:$i]:(cQ @ esk2_0 @ X1|~cQ @ X1 @ esk1_0), inference(spm,[status(thm)],[c_0_18, c_0_19])). 0.11/0.38 thf(c_0_23, plain, ![X1:$i]:(cQ @ X1 @ esk2_0|~cP @ esk1_0 @ X1), inference(spm,[status(thm)],[c_0_20, c_0_10])). 0.11/0.38 thf(c_0_24, plain, ![X1:$i]:(~cQ @ X1 @ esk3_0|~cQ @ esk4_0 @ X1), inference(spm,[status(thm)],[c_0_21, c_0_18])). 0.11/0.38 thf(c_0_25, plain, ![X1:$i]:(cQ @ esk2_0 @ X1|~cQ @ esk1_0 @ X1), inference(spm,[status(thm)],[c_0_22, c_0_18])). 0.11/0.38 thf(c_0_26, plain, ![X1:$i]:(cQ @ esk1_0 @ X1|cQ @ X1 @ esk2_0), inference(spm,[status(thm)],[c_0_23, c_0_10])). 0.11/0.38 thf(c_0_27, plain, (~cQ @ esk4_0 @ esk2_0|~cQ @ esk1_0 @ esk3_0), inference(spm,[status(thm)],[c_0_24, c_0_25])). 0.11/0.38 thf(c_0_28, plain, ~cQ @ esk1_0 @ esk3_0, inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_26]), c_0_27])). 0.11/0.38 thf(c_0_29, negated_conjecture, (~cQ @ esk3_0 @ esk2_0|~cQ @ esk1_0 @ esk4_0), inference(spm,[status(thm)],[c_0_17, c_0_25])). 0.11/0.38 thf(c_0_30, plain, cQ @ esk3_0 @ esk2_0, inference(spm,[status(thm)],[c_0_28, c_0_26])). 0.11/0.38 thf(c_0_31, negated_conjecture, ~cQ @ esk1_0 @ esk4_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29, c_0_30])])). 0.11/0.38 thf(c_0_32, plain, ![X1:$i]:(~cQ @ esk3_0 @ X1|~cQ @ esk4_0 @ X1), inference(spm,[status(thm)],[c_0_17, c_0_18])). 0.11/0.38 thf(c_0_33, plain, cQ @ esk4_0 @ esk2_0, inference(spm,[status(thm)],[c_0_31, c_0_26])). 0.11/0.38 thf(c_0_34, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_30])]), ['proof']). 0.11/0.38 # SZS output end CNFRefutation 0.11/0.38 # Proof object total steps : 35 0.11/0.38 # Proof object clause steps : 29 0.11/0.38 # Proof object formula steps : 6 0.11/0.38 # Proof object conjectures : 11 0.11/0.38 # Proof object clause conjectures : 8 0.11/0.38 # Proof object formula conjectures : 3 0.11/0.38 # Proof object initial clauses used : 7 0.11/0.38 # Proof object initial formulas used : 1 0.11/0.38 # Proof object generating inferences : 17 0.11/0.38 # Proof object simplifying inferences : 13 0.11/0.38 # Training examples: 0 positive, 0 negative 0.11/0.38 # Parsed axioms : 3 0.11/0.38 # Removed by relevancy pruning/SinE : 0 0.11/0.38 # Initial clauses : 9 0.11/0.38 # Removed in clause preprocessing : 2 0.11/0.38 # Initial clauses in saturation : 7 0.11/0.38 # Processed clauses : 62 0.11/0.38 # ...of these trivial : 0 0.11/0.38 # ...subsumed : 18 0.11/0.38 # ...remaining for further processing : 44 0.11/0.38 # Other redundant clauses eliminated : 0 0.11/0.38 # Clauses deleted for lack of memory : 0 0.11/0.38 # Backward-subsumed : 0 0.11/0.38 # Backward-rewritten : 7 0.11/0.38 # Generated clauses : 261 0.11/0.38 # ...of the previous two non-trivial : 266 0.11/0.38 # Contextual simplify-reflections : 1 0.11/0.38 # Paramodulations : 261 0.11/0.38 # Factorizations : 0 0.11/0.38 # NegExts : 0 0.11/0.38 # Equation resolutions : 0 0.11/0.38 # Propositional unsat checks : 0 0.11/0.38 # Propositional check models : 0 0.11/0.38 # Propositional check unsatisfiable : 0 0.11/0.38 # Propositional clauses : 0 0.11/0.38 # Propositional clauses after purity: 0 0.11/0.38 # Propositional unsat core size : 0 0.11/0.38 # Propositional preprocessing time : 0.000 0.11/0.38 # Propositional encoding time : 0.000 0.11/0.38 # Propositional solver time : 0.000 0.11/0.38 # Success case prop preproc time : 0.000 0.11/0.38 # Success case prop encoding time : 0.000 0.11/0.38 # Success case prop solver time : 0.000 0.11/0.38 # Current number of processed clauses : 30 0.11/0.38 # Positive orientable unit clauses : 4 0.11/0.38 # Positive unorientable unit clauses: 0 0.11/0.38 # Negative unit clauses : 5 0.11/0.38 # Non-unit-clauses : 21 0.11/0.38 # Current number of unprocessed clauses: 213 0.11/0.38 # ...number of literals in the above : 721 0.11/0.38 # Current number of archived formulas : 0 0.11/0.38 # Current number of archived clauses : 14 0.11/0.38 # Clause-clause subsumption calls (NU) : 320 0.11/0.38 # Rec. Clause-clause subsumption calls : 285 0.11/0.38 # Non-unit clause-clause subsumptions : 19 0.11/0.38 # Unit Clause-clause subsumption calls : 50 0.11/0.38 # Rewrite failures with RHS unbound : 0 0.11/0.38 # BW rewrite match attempts : 2 0.11/0.38 # BW rewrite match successes : 2 0.11/0.38 # Condensation attempts : 0 0.11/0.38 # Condensation successes : 0 0.11/0.38 # Termbank termtop insertions : 2958 0.11/0.38 0.11/0.38 # ------------------------------------------------- 0.11/0.38 # User time : 0.029 s 0.11/0.38 # System time : 0.006 s 0.11/0.38 # Total time : 0.035 s 0.11/0.38 # Maximum resident set size: 1632 pages 0.11/0.38 EOF